Tight local approximation results for max-min linear programs

In a bipartite max-min LP, we are given a bipartite graph \myG = (V \cup I \cup K, E), where each agent $v \in V$ is adjacent to exactly one constraint $i \in I$ and exactly one objective $k \in K$. Each agent $v$ controls a variable $x_v$. For each $i \in I$ we have a nonnegative linear constraint on the variables of adjacent agents. For each $k \in K$ we have a nonnegative linear objective function of the variables of adjacent agents. The task is to maximise the minimum of the objective functions. We study local algorithms where each agent $v$ must choose $x_v$ based on input within its constant-radius neighbourhood in \myG. We show that for every $\epsilon>0$ there exists a local algorithm achieving the approximation ratio ${\Delta_I (1 - 1/\Delta_K)} + \epsilon$. We also show that this result is the best possible -- no local algorithm can achieve the approximation ratio ${\Delta_I (1 - 1/\Delta_K)}$. Here $\Delta_I$ is the maximum degree of a vertex $i \in I$, and $\Delta_K$ is the maximum degree of a vertex $k \in K$. As a methodological contribution, we introduce the technique of graph unfolding for the design of local approximation algorithms.Comment: 16 page

On the key expansion of D(n, K)-based cryptographical algorithm

The family of algebraic graphs D(n, K) defined over finite commutative ring K have been used in different cryptographical algorithms (private and public keys, key exchange protocols). The encryption maps correspond to special walks on this graph. We expand the class of encryption maps via the use of edge transitive automorphism group G(n, K) of D(n, K). The graph D(n, K) and related directed graphs are disconnected. So private keys corresponding to walks preserve each connected component. The group G(n, K) of transformations generated by an expanded set of encryption maps acts transitively on the plainspace. Thus we have a great difference with block ciphers, any plaintexts can be transformed to an arbitrarily chosen ciphertex by an encryption map. The plainspace for the D(n, K) graph based encryption is a free module P over the ring K. The group G(n, K) is a subgroup of Cremona group of all polynomial automorphisms. The maximal degree for a polynomial from G(n, K) is 3. We discuss the Diffie-Hellman algorithm based on the discrete logarithm problem for the group τ-1Gτ, where τ is invertible affine transformation of free module P i.e. polynomial automorphism of degree 1. We consider some relations for the discrete logarithm problem for G(n, K) and public key algorithm based on the D(n, K) graphs

The history of degenerate (bipartite) extremal graph problems

This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and constructions.Comment: 97 pages, 11 figures, many problems. This is the preliminary version of our survey presented in Erdos 100. In this version 2 only a citation was complete

Spatial Statistics of Visual Keypoints for Texture Recognition

recognitio

Asymptotic Limits and Zeros of Chromatic Polynomials and Ground State Entropy of Potts Antiferromagnets

We study the asymptotic limiting function $W({G},q) = \lim_{n \to \infty}P(G,q)^{1/n}$, where $P(G,q)$ is the chromatic polynomial for a graph $G$ with $n$ vertices. We first discuss a subtlety in the definition of $W({G},q)$ resulting from the fact that at certain special points $q_s$, the following limits do not commute: $\lim_{n \to \infty} \lim_{q \to q_s} P(G,q)^{1/n} \ne \lim_{q \to q_s} \lim_{n \to \infty} P(G,q)^{1/n}$. We then present exact calculations of $W({G},q)$ and determine the corresponding analytic structure in the complex $q$ plane for a number of families of graphs ${G}$, including circuits, wheels, biwheels, bipyramids, and (cyclic and twisted) ladders. We study the zeros of the corresponding chromatic polynomials and prove a theorem that for certain families of graphs, all but a finite number of the zeros lie exactly on a unit circle, whose position depends on the family. Using the connection of $P(G,q)$ with the zero-temperature Potts antiferromagnet, we derive a theorem concerning the maximal finite real point of non-analyticity in $W({G},q)$, denoted $q_c$ and apply this theorem to deduce that $q_c(sq)=3$ and $q_c(hc) = (3+\sqrt{5})/2$ for the square and honeycomb lattices. Finally, numerical calculations of $W(hc,q)$ and $W(sq,q)$ are presented and compared with series expansions and bounds.Comment: 33 pages, Latex, 5 postscript figures, published version; includes further comments on large-q serie

Max-Margin Dictionary Learning for Multiclass Image Categorization

Abstract. Visual dictionary learning and base (binary) classifier train-ing are two basic problems for the recently most popular image cate-gorization framework, which is based on the bag-of-visual-terms (BOV) models and multiclass SVM classifiers. In this paper, we study new algo-rithms to improve performance of this framework from these two aspects. Typically SVM classifiers are trained with dictionaries fixed, and as a re-sult the traditional loss function can only be minimized with respect to hyperplane parameters (w and b). We propose a novel loss function for a binary classifier, which links the hinge-loss term with dictionary learning. By doing so, we can further optimize the loss function with respect to the dictionary parameters. Thus, this framework is able to further increase margins of binary classifiers, and consequently decrease the error bound of the aggregated classifier. On two benchmark dataset

Regular graphs of large girth and arbitrary degree

For every integer d > 9, we construct infinite families {G_n}_n of d+1-regular graphs which have a large girth > log_d |G_n|, and for d large enough > 1,33 log_d |G_n|. These are Cayley graphs on PGL_2(q) for a special set of d+1 generators whose choice is related to the arithmetic of integral quaternions. These graphs are inspired by the Ramanujan graphs of Lubotzky-Philips-Sarnak and Margulis, with which they coincide when d is prime. When d is not equal to the power of an odd prime, this improves the previous construction of Imrich in 1984 where he obtained infinite families {I_n}_n of d+1-regular graphs, realized as Cayley graphs on SL_2(q), and which are displaying a girth > 0,48 log_d |I_n|. And when d is equal to a power of 2, this improves a construction by Morgenstern in 1994 where certain families {M_n}_n of 2^k+1-regular graphs were shown to have a girth > 2/3 log_d |M_n|.Comment: (15 pages) Accepted at Combinatorica. Title changed following referee's suggestion. Revised version after reviewing proces

Organometallic iridium(III) anticancer complexes with new mechanisms of action: NCI-60 screening, mitochondrial targeting, and apoptosis

Platinum complexes related to cisplatin, cis-[PtCl2(NH3)2], are successful anticancer drugs; however, other transition metal complexes offer potential for combating cisplatin resistance, decreasing side effects, and widening the spectrum of activity. Organometallic half-sandwich iridium (IrIII) complexes [Ir(Cpx)(XY)Cl]+/0 (Cpx = biphenyltetramethylcyclopentadienyl and XY = phenanthroline (1), bipyridine (2), or phenylpyridine (3)) all hydrolyze rapidly, forming monofunctional G adducts on DNA with additional intercalation of the phenyl substituents on the Cpx ring. In comparison, highly potent complex 4 (Cpx = phenyltetramethylcyclopentadienyl and XY = N,N-dimethylphenylazopyridine) does not hydrolyze. All show higher potency toward A2780 human ovarian cancer cells compared to cisplatin, with 1, 3, and 4 also demonstrating higher potency in the National Cancer Institute (NCI) NCI-60 cell-line screen. Use of the NCI COMPARE algorithm (which predicts mechanisms of action (MoAs) for emerging anticancer compounds by correlating NCI-60 patterns of sensitivity) shows that the MoA of these IrIII complexes has no correlation to cisplatin (or oxaliplatin), with 3 and 4 emerging as particularly novel compounds. Those findings by COMPARE were experimentally probed by transmission electron microscopy (TEM) of A2780 cells exposed to 1, showing mitochondrial swelling and activation of apoptosis after 24 h. Significant changes in mitochondrial membrane polarization were detected by flow cytometry, and the potency of the complexes was enhanced ca. 5× by co-administration with a low concentration (5 μM) of the γ-glutamyl cysteine synthetase inhibitor L-buthionine sulfoximine (L-BSO). These studies reveal potential polypharmacology of organometallic IrIII complexes, with MoA and cell selectivity governed by structural changes in the chelating ligands